Walks and regular integral graphs

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Regular integral sum graphs

Given a set of integers S; G(S) = (S; E) is a graph, where the edge uv exists if and only if u+ v∈ S. A graph G = (V; E) is an integral sum graph or ISG if there exists a set S ⊂ Z such that G=G(S). This set is called a labeling of G. The main results of this paper concern regular ISGs. It is proved that all 2-regular graphs with the exception of C4 are integral sum graphs and that for every po...

متن کامل

Quantum Walks on Regular Graphs and Eigenvalues

We study the transition matrix of a quantum walk on strongly regular graphs. It is proposed by Emms, Hancock, Severini and Wilson in 2006, that the spectrum of S+(U3), a matrix based on the amplitudes of walks in the quantum walk, distinguishes strongly regular graphs. We find the eigenvalues of S+(U) and S+(U2) for regular graphs and show that S+(U2) = S+(U)2 + I.

متن کامل

Random Walks on Regular and Irregular Graphs

For an undirected graph and an optimal cyclic list of all its vertices, the cyclic cover time is the expected time it takes a simple random walk to travel from vertex to vertex along the list, until it completes a full cycle. The main result of this paper is a characterization of the cyclic cover time in terms of simple and easy to compute graph properties. Namely, for any connected graph, the ...

متن کامل

Multiple Random Walks in Random Regular Graphs

We study properties of multiple random walks on a graph under various assumptions of interaction between the particles. To give precise results, we make the analysis for random regular graphs. The cover time of a random walk on a random r-regular graph was studied in [6], where it was shown with high probability (whp), that for r ≥ 3 the cover time is asymptotic to θrn lnn, where θr = (r − 1)/(...

متن کامل

Nonexistence of Some 4-regular Integral Graphs

A graph is called integral if all its eigenvalues are integers. The quest for integral graphs was initiated by F. Harary and A. J. Schwenk [9]. All such cubic graphs were obtained by D. Cvetković and F. C. Bussemaker [2, 1], and independently by A. J. Schwenk [10]. There are exactly thirteen cubic integral graphs. In fact, D. Cvetković [2] proved that the set of regular integral graphs of a fix...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2007

ISSN: 0024-3795

DOI: 10.1016/j.laa.2006.11.026